Graph Mining for Object Tracking in Videos

International audienceThis paper shows a concrete example of the use of graph mining for tracking objects in videos with moving cameras and without any contextual information on the objects to track. To make the mining algorithm efficient, we benefit from a video representation based on dy- namic (evolving through time) planar graphs. We then define a number of constraints to efficiently find our so-called spatio-temporal graph pat- terns. Those patterns are linked through an occurrences graph to allow us to tackle occlusion or graph features instability problems in the video. Experiments on synthetic and real videos show that our method is effec- tive and allows us to find relevant patterns for our tracking application

Flexible constrained sampling with guarantees for pattern mining

Pattern sampling has been proposed as a potential solution to the infamous pattern explosion. Instead of enumerating all patterns that satisfy the constraints, individual patterns are sampled proportional to a given quality measure. Several sampling algorithms have been proposed, but each of them has its limitations when it comes to 1) flexibility in terms of quality measures and constraints that can be used, and/or 2) guarantees with respect to sampling accuracy. We therefore present Flexics, the first flexible pattern sampler that supports a broad class of quality measures and constraints, while providing strong guarantees regarding sampling accuracy. To achieve this, we leverage the perspective on pattern mining as a constraint satisfaction problem and build upon the latest advances in sampling solutions in SAT as well as existing pattern mining algorithms. Furthermore, the proposed algorithm is applicable to a variety of pattern languages, which allows us to introduce and tackle the novel task of sampling sets of patterns. We introduce and empirically evaluate two variants of Flexics: 1) a generic variant that addresses the well-known itemset sampling task and the novel pattern set sampling task as well as a wide range of expressive constraints within these tasks, and 2) a specialized variant that exploits existing frequent itemset techniques to achieve substantial speed-ups. Experiments show that Flexics is both accurate and efficient, making it a useful tool for pattern-based data exploration.Comment: Accepted for publication in Data Mining & Knowledge Discovery journal (ECML/PKDD 2017 journal track

The topology of a discussion: the #occupy case

We analyse a large sample of the Twitter activity developed around the social movement 'Occupy Wall Street' to study the complex interactions between the human communication activity and the semantic content of a discussion. We use a network approach based on the analysis of the bipartite graph @Users-#Hashtags and of its projections: the 'semantic network', whose nodes are hashtags, and the 'users interest network', whose nodes are users In the first instance, we find out that discussion topics (#hashtags) present a high heterogeneity, with the distinct role of the communication hubs where most the 'opinion traffic' passes through. In the second case, the self-organization process of users activity leads to the emergence of two classes of communicators: the 'professionals' and the 'amateurs'. Moreover the network presents a strong community structure, based on the differentiation of the semantic topics, and a high level of structural robustness when a certain set of topics are censored and/or accounts are removed. Analysing the characteristics the @Users-#Hashtags network we can distinguish three phases of the discussion about the movement. Each phase corresponds to specific moment of the movement: from declaration of intent, organisation and development and the final phase of political reactions. Each phase is characterised by the presence of specific #hashtags in the discussion. Keywords: Twitter, Network analysisComment: 13 pages, 9 figure

Mining attribute evolution rules in dynamic attributed graphs

A dynamic attributed graph is a graph that changes over time and where each vertex is described using multiple continuous attributes. Such graphs are found in numerous domains, e.g., social network analysis. Several studies have been done on discovering patterns in dynamic attributed graphs to reveal how attribute(s) change over time. However, many algorithms restrict all attribute values in a pattern to follow the same trend (e.g. increase) and the set of vertices in a pattern to be fixed, while others consider that a single vertex may influence its neighbors. As a result, these algorithms are unable to find complex patterns that show the influence of multiple vertices on many other vertices in terms of several attributes and different trends. This paper addresses this issue by proposing to discover a novel type of patterns called attribute evolution rules (AER). These rules indicate how changes of attribute values of multiple vertices may influence those of others with a high confidence. An efficient algorithm named AER-Miner is proposed to find these rules. Experiments on real data show AER-Miner is efficient and that AERs can provide interesting insights about dynamic attributed graphs

The struggle for existence in the world market ecosystem

The global trade system can be viewed as a dynamic ecosystem in which exporters struggle for resources: the markets in which they export. We can think that the aim of an exporter is to gain the entirety of a market share (say, car imports from the United States). This is similar to the objective of an organism in its attempt to monopolize a given subset of resources in an ecosystem. In this paper, we adopt a multilayer network approach to describe this struggle. We use longitudinal, multiplex data on trade relations, spanning several decades. We connect two countries with a directed link if the source country's appearance in a market correlates with the target country's disappearing, where a market is defined as a country-product combination in a given decade. Each market is a layer in the network. We show that, by analyzing the countries' network roles in each layer, we are able to classify them as out-competing, transitioning or displaced. This classification is a meaningful one: when testing the future export patterns of these countries, we show that out-competing countries have distinctly stronger growth rates than the other two classes

CTNSmRNA as a potential treatment for nephropathic cystinosis

Messenger RNA (mRNA) therapies are emerging in different disease areas, but have not yet reached the kidney field. Our aim was to study the feasibility to correct the genetic defect in nephropathic cystinosis using synthetic mRNA. Cystinosis is a prototype disorder of proximal tubular dysfunction caused by mutations in the CTNS gene, encoding the lysosomal cystine-H+ symporter cystinosin, and leading to cystine accumulation in all cells of the body. The kidneys are the first and most severely affected organs, presenting glomerular and proximal tubular dysfunction. Cysteamine is the current therapeutic standard that reduces cellular cystine levels, but has many side effects and does not restore kidney function. Here, we show that synthetic mRNA is safe and effective to reintroduce functional cystinosin using lipofection in CTNS-/- kidney cells and following direct injection in ctns-/- zebrafish larvae. CTNS mRNA therapy results in prompt lysosomal expression of the functional protein and decreases cellular cystine accumulation for up to 14 days. In the ctns-/- zebrafish, CTNS mRNA therapy improves proximal tubular reabsorption, reduces proteinuria, and restores brush border expression of the multi-ligand receptor megalin. We propose that mRNA-based therapy, if sufficient kidney targeting can be achieved, may be a new approach to treat cystinosis